0.00/0.07	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.08	% Command    : run_E %s %d THM
0.06/0.27	% Computer : n007.cluster.edu
0.06/0.27	% Model    : x86_64 x86_64
0.06/0.27	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.06/0.27	% Memory   : 8042.1875MB
0.06/0.27	% OS       : Linux 3.10.0-693.el7.x86_64
0.06/0.27	% CPULimit   : 960
0.06/0.27	% WCLimit    : 120
0.06/0.27	% DateTime   : Tue Aug  9 05:28:57 EDT 2022
0.06/0.27	% CPUTime    : 
0.12/0.36	Running higher-order on 8 cores theorem proving
0.12/0.36	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.12/0.36	# Version: 3.0pre003-ho
0.12/0.37	# Preprocessing class: HSSSSMSSMLSNHSN.
0.12/0.37	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.12/0.37	# Starting new_ho_9 with 600s (5) cores
0.12/0.37	# Starting post_as_ho1 with 120s (1) cores
0.12/0.37	# Starting sh1l with 120s (1) cores
0.12/0.37	# Starting post_as_ho10 with 120s (1) cores
0.12/0.37	# sh1l with pid 13391 completed with status 0
0.12/0.37	# Result found by sh1l
0.12/0.37	# Preprocessing class: HSSSSMSSMLSNHSN.
0.12/0.37	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.12/0.37	# Starting new_ho_9 with 600s (5) cores
0.12/0.37	# Starting post_as_ho1 with 120s (1) cores
0.12/0.37	# Starting sh1l with 120s (1) cores
0.12/0.37	# No SInE strategy applied
0.12/0.37	# Search class: HGHNF-FFSS00-SHSSMFNN
0.12/0.37	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.12/0.37	# Starting new_ho_10 with 65s (1) cores
0.12/0.37	# new_ho_10 with pid 13396 completed with status 0
0.12/0.37	# Result found by new_ho_10
0.12/0.37	# Preprocessing class: HSSSSMSSMLSNHSN.
0.12/0.37	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.12/0.37	# Starting new_ho_9 with 600s (5) cores
0.12/0.37	# Starting post_as_ho1 with 120s (1) cores
0.12/0.37	# Starting sh1l with 120s (1) cores
0.12/0.37	# No SInE strategy applied
0.12/0.37	# Search class: HGHNF-FFSS00-SHSSMFNN
0.12/0.37	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.12/0.37	# Starting new_ho_10 with 65s (1) cores
0.12/0.37	# Preprocessing time       : 0.001 s
0.12/0.37	# Presaturation interreduction done
0.12/0.37	
0.12/0.37	# Proof found!
0.12/0.37	# SZS status Theorem
0.12/0.37	# SZS output start CNFRefutation
0.12/0.37	thf(decl_22, type, subrel: ($i > $i > $o) > ($i > $i > $o) > $o).
0.12/0.37	thf(decl_23, type, inv: ($i > $i > $o) > $i > $i > $o).
0.12/0.37	thf(decl_24, type, idem: (($i > $i > $o) > $i > $i > $o) > $o).
0.12/0.37	thf(decl_25, type, infl: (($i > $i > $o) > $i > $i > $o) > $o).
0.12/0.37	thf(decl_26, type, mono: (($i > $i > $o) > $i > $i > $o) > $o).
0.12/0.37	thf(decl_27, type, refl: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_28, type, irrefl: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_29, type, rc: ($i > $i > $o) > $i > $i > $o).
0.12/0.37	thf(decl_30, type, symm: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_31, type, antisymm: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_32, type, asymm: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_33, type, sc: ($i > $i > $o) > $i > $i > $o).
0.12/0.37	thf(decl_34, type, trans: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_35, type, tc: ($i > $i > $o) > $i > $i > $o).
0.12/0.37	thf(decl_36, type, trc: ($i > $i > $o) > $i > $i > $o).
0.12/0.37	thf(decl_37, type, trsc: ($i > $i > $o) > $i > $i > $o).
0.12/0.37	thf(decl_38, type, po: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_39, type, so: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_40, type, total: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_41, type, term: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_42, type, ind: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_43, type, innf: ($i > $i > $o) > $i > $o).
0.12/0.37	thf(decl_44, type, nfof: ($i > $i > $o) > $i > $i > $o).
0.12/0.37	thf(decl_45, type, norm: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_46, type, join: ($i > $i > $o) > $i > $i > $o).
0.12/0.37	thf(decl_47, type, lconfl: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_48, type, sconfl: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_49, type, confl: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_50, type, cr: ($i > $i > $o) > $o).
0.12/0.37	thf(decl_51, type, epred1_0: $i > $i > $o).
0.12/0.37	thf(decl_52, type, esk1_0: $i).
0.12/0.37	thf(decl_53, type, esk2_0: $i).
0.12/0.37	thf(decl_54, type, esk3_0: $i).
0.12/0.37	thf(decl_55, type, esk4_0: $i).
0.12/0.37	thf(decl_56, type, esk5_0: $i).
0.12/0.37	thf(strict_order, axiom, ((so)=(^[X1:$i > $i > $o]:(((asymm @ X1)&(trans @ X1))))), file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax', strict_order)).
0.12/0.37	thf(asymmetric, axiom, ((asymm)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i]:(((X1 @ X3 @ X4)=>~((X1 @ X4 @ X3))))))), file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax', asymmetric)).
0.12/0.37	thf(transitive, axiom, ((trans)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X6))=>(X1 @ X3 @ X6)))))), file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax', transitive)).
0.12/0.37	thf(inverse, axiom, ((inv)=(^[X1:$i > $i > $o, X3:$i, X4:$i]:((X1 @ X4 @ X3)))), file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax', inverse)).
0.12/0.37	thf(inverse_of_strict_order_is_strict_order, conjecture, ![X1:$i > $i > $o]:(((so @ (inv @ X1))<=(so @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', inverse_of_strict_order_is_strict_order)).
0.12/0.37	thf(c_0_5, plain, ((so)=(^[Z0:$i > $i > $o]:(((![X39:$i, X40:$i]:(((Z0 @ X39 @ X40)=>~((Z0 @ X40 @ X39)))))&(![X41:$i, X42:$i, X43:$i]:((((Z0 @ X41 @ X42)&(Z0 @ X42 @ X43))=>(Z0 @ X41 @ X43)))))))), inference(fof_simplification,[status(thm)],[strict_order])).
0.12/0.37	thf(c_0_6, plain, ((asymm)=(^[Z0:$i > $i > $o]:(![X3:$i, X4:$i]:(((Z0 @ X3 @ X4)=>~((Z0 @ X4 @ X3))))))), inference(fof_simplification,[status(thm)],[asymmetric])).
0.12/0.37	thf(c_0_7, plain, ((trans)=(^[Z0:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((Z0 @ X3 @ X4)&(Z0 @ X4 @ X6))=>(Z0 @ X3 @ X6)))))), inference(fof_simplification,[status(thm)],[transitive])).
0.12/0.37	thf(c_0_8, plain, ((inv)=(^[Z0:$i > $i > $o, Z1:$i, Z2:$i]:((Z0 @ Z2 @ Z1)))), inference(fof_simplification,[status(thm)],[inverse])).
0.12/0.37	thf(c_0_9, plain, ((so)=(^[Z0:$i > $i > $o]:(((![X39:$i, X40:$i]:(((Z0 @ X39 @ X40)=>~((Z0 @ X40 @ X39)))))&(![X41:$i, X42:$i, X43:$i]:((((Z0 @ X41 @ X42)&(Z0 @ X42 @ X43))=>(Z0 @ X41 @ X43)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5, c_0_6]), c_0_7])).
0.12/0.37	thf(c_0_10, negated_conjecture, ~(![X1:$i > $i > $o]:(((![X163:$i, X164:$i]:(((X1 @ X163 @ X164)=>~(X1 @ X164 @ X163)))&![X165:$i, X166:$i, X167:$i]:((((X1 @ X165 @ X166)&(X1 @ X166 @ X167))=>(X1 @ X165 @ X167))))=>(![X158:$i, X159:$i]:(((X1 @ X159 @ X158)=>~(X1 @ X158 @ X159)))&![X160:$i, X161:$i, X162:$i]:((((X1 @ X161 @ X160)&(X1 @ X162 @ X161))=>(X1 @ X162 @ X160))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[inverse_of_strict_order_is_strict_order]), c_0_8]), c_0_9])])).
0.12/0.37	thf(c_0_11, negated_conjecture, ![X169:$i, X170:$i, X171:$i, X172:$i, X173:$i]:((((~(epred1_0 @ X169 @ X170)|~(epred1_0 @ X170 @ X169))&(~(epred1_0 @ X171 @ X172)|~(epred1_0 @ X172 @ X173)|(epred1_0 @ X171 @ X173)))&(((((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk2_0 @ esk1_0))&((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk2_0 @ esk1_0)))&(~(epred1_0 @ esk5_0 @ esk3_0)|(epred1_0 @ esk2_0 @ esk1_0)))&((((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0))&((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk2_0)))&(~(epred1_0 @ esk5_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])).
0.12/0.37	thf(c_0_12, negated_conjecture, ![X3:$i, X4:$i, X6:$i]:(((epred1_0 @ X3 @ X6)|~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.12/0.37	thf(c_0_13, negated_conjecture, ((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.12/0.37	thf(c_0_14, negated_conjecture, ![X3:$i]:(((epred1_0 @ esk1_0 @ esk2_0)|(epred1_0 @ X3 @ esk3_0)|~((epred1_0 @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.12/0.37	thf(c_0_15, negated_conjecture, ((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.12/0.37	thf(c_0_16, negated_conjecture, ((epred1_0 @ esk1_0 @ esk2_0)|~((epred1_0 @ esk5_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.12/0.37	thf(c_0_17, negated_conjecture, ![X4:$i, X3:$i]:((~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.12/0.37	thf(c_0_18, negated_conjecture, (epred1_0 @ esk1_0 @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])).
0.12/0.37	thf(c_0_19, negated_conjecture, ((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.12/0.37	thf(c_0_20, negated_conjecture, ~((epred1_0 @ esk2_0 @ esk1_0)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.12/0.37	thf(c_0_21, negated_conjecture, (epred1_0 @ esk4_0 @ esk3_0), inference(sr,[status(thm)],[c_0_19, c_0_20])).
0.12/0.37	thf(c_0_22, negated_conjecture, ((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.12/0.37	thf(c_0_23, negated_conjecture, ((epred1_0 @ esk2_0 @ esk1_0)|~((epred1_0 @ esk5_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.12/0.37	thf(c_0_24, negated_conjecture, ![X3:$i]:(((epred1_0 @ X3 @ esk3_0)|~((epred1_0 @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_12, c_0_21])).
0.12/0.37	thf(c_0_25, negated_conjecture, (epred1_0 @ esk5_0 @ esk4_0), inference(sr,[status(thm)],[c_0_22, c_0_20])).
0.12/0.37	thf(c_0_26, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])]), c_0_20]), ['proof']).
0.12/0.37	# SZS output end CNFRefutation
0.12/0.37	# Parsed axioms                        : 59
0.12/0.37	# Removed by relevancy pruning/SinE    : 0
0.12/0.37	# Initial clauses                      : 37
0.12/0.37	# Removed in clause preprocessing      : 29
0.12/0.37	# Initial clauses in saturation        : 8
0.12/0.37	# Processed clauses                    : 31
0.12/0.37	# ...of these trivial                  : 0
0.12/0.37	# ...subsumed                          : 0
0.12/0.37	# ...remaining for further processing  : 31
0.12/0.37	# Other redundant clauses eliminated   : 0
0.12/0.37	# Clauses deleted for lack of memory   : 0
0.12/0.37	# Backward-subsumed                    : 3
0.12/0.37	# Backward-rewritten                   : 7
0.12/0.37	# Generated clauses                    : 21
0.12/0.37	# ...of the previous two non-redundant : 18
0.12/0.37	# ...aggressively subsumed             : 0
0.12/0.37	# Contextual simplify-reflections      : 1
0.12/0.37	# Paramodulations                      : 19
0.12/0.37	# Factorizations                       : 0
0.12/0.37	# NegExts                              : 0
0.12/0.37	# Equation resolutions                 : 0
0.12/0.37	# Propositional unsat checks           : 0
0.12/0.37	#    Propositional check models        : 0
0.12/0.37	#    Propositional check unsatisfiable : 0
0.12/0.37	#    Propositional clauses             : 0
0.12/0.37	#    Propositional clauses after purity: 0
0.12/0.37	#    Propositional unsat core size     : 0
0.12/0.37	#    Propositional preprocessing time  : 0.000
0.12/0.37	#    Propositional encoding time       : 0.000
0.12/0.37	#    Propositional solver time         : 0.000
0.12/0.37	#    Success case prop preproc time    : 0.000
0.12/0.37	#    Success case prop encoding time   : 0.000
0.12/0.37	#    Success case prop solver time     : 0.000
0.12/0.37	# Current number of processed clauses  : 11
0.12/0.37	#    Positive orientable unit clauses  : 3
0.12/0.37	#    Positive unorientable unit clauses: 0
0.12/0.37	#    Negative unit clauses             : 3
0.12/0.37	#    Non-unit-clauses                  : 5
0.12/0.37	# Current number of unprocessed clauses: 3
0.12/0.37	# ...number of literals in the above   : 8
0.12/0.37	# Current number of archived formulas  : 0
0.12/0.37	# Current number of archived clauses   : 20
0.12/0.37	# Clause-clause subsumption calls (NU) : 83
0.12/0.37	# Rec. Clause-clause subsumption calls : 77
0.12/0.37	# Non-unit clause-clause subsumptions  : 2
0.12/0.37	# Unit Clause-clause subsumption calls : 15
0.12/0.37	# Rewrite failures with RHS unbound    : 0
0.12/0.37	# BW rewrite match attempts            : 1
0.12/0.37	# BW rewrite match successes           : 1
0.12/0.37	# Condensation attempts                : 31
0.12/0.37	# Condensation successes               : 0
0.12/0.37	# Termbank termtop insertions          : 3497
0.12/0.37	
0.12/0.37	# -------------------------------------------------
0.12/0.37	# User time                : 0.003 s
0.12/0.37	# System time              : 0.004 s
0.12/0.37	# Total time               : 0.007 s
0.12/0.37	# Maximum resident set size: 2160 pages
0.12/0.37	
0.12/0.37	# -------------------------------------------------
0.12/0.37	# User time                : 0.004 s
0.12/0.37	# System time              : 0.005 s
0.12/0.37	# Total time               : 0.010 s
0.12/0.37	# Maximum resident set size: 1784 pages
0.12/0.37	EOF